Abstracting Soft Constraints
نویسندگان
چکیده
ing Soft Constraint S. Bistarelli1, P. Codognet2, Y. Georget3, F. Rossi4 1: Universit a di Pisa, Dipartimento di Informatica, Corso Italia 40, 56125 Pisa, Italy. E-mail: [email protected] 2: University of Paris 6, LIP6, case 169, 4, Place Jussieu, 75 252 Paris Cedex 05, France. E-mail: [email protected] 3: INRIA Rocquencourt, BP 105, 78153 Le Chesnay, France. E-mail: [email protected] 4: Universit a di Padova, Dipartimento di Matematica, Via Belzoni 7, 35131 Padova, Italy. E-mail: [email protected] Abstract. We propose an abstraction scheme for soft constraint problems and we study its main properties. Processing the abstracted version of a soft constraint problem can help us in many ways: for example, to nd good approximations of the optimal solutions, or also to provide us with information that can make the subsequent search for the best solution easier. The results of this paper show that the proposed scheme is promising; thus they can be used as a stable formal base for any experimental work speci c to a particular class of soft constraint problems.
منابع مشابه
Abstracting Soft Constraints: Some Experimental Results on Fuzzy CSPs
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs Stefano Bistarelli1 2, Francesca Rossi3, and Isabella Pilan3 1 Istituto di Informatica e Telematica, CNR, Pisa, Italy [email protected] 2 Dipartimento di Scienze Universitá degli Studi “G. D’annunzio” di Chieti-Pescara, Italy [email protected] 3 Dipartimento di Matematica Pura ed Applicata Università di Padova, Italy fro...
متن کاملPreferences in Constraint Satisfaction and Optimization
ion Soft constraints are much more expressive than classical CSPs, but they are also more difficult to process and to solve. Therefore, sometimes it may be too costly to find all, or even only one, optimal solution. Also, although classical propagation techniques like arc-consistency can be extended to soft constraints (Meseguer, Rossi, and Schiex 2006), such techniques can be too costly to be ...
متن کاملبهینه سازی برنامه ریزی هفتگی دروس دانشگاهی با روشهای جستجوی محلی
University course timetabling problem is a complicated problem and finding a computer-aided solution for it was a subject to work for many years. To solve this problem, we must assign courses to timeslots with respect to hard and soft constraints. Hard constraints are those which must be necessarily met (some of them could be neglected with high costs). Our aim is to meet as many soft constrain...
متن کاملAbstracting any Vehicle Shape and the Kinematics and Dynamic Constraints from Reactive Collision Avoidance Methods
ing any Vehicle Shape and the Kinematics and Dynamic Constraints from Reactive Collision Avoidance Methods
متن کامل